全文获取类型
收费全文 | 592篇 |
免费 | 238篇 |
国内免费 | 19篇 |
出版年
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 12篇 |
2021年 | 18篇 |
2020年 | 10篇 |
2019年 | 24篇 |
2018年 | 14篇 |
2017年 | 33篇 |
2016年 | 42篇 |
2015年 | 34篇 |
2014年 | 74篇 |
2013年 | 71篇 |
2012年 | 51篇 |
2011年 | 35篇 |
2010年 | 43篇 |
2009年 | 37篇 |
2008年 | 30篇 |
2007年 | 28篇 |
2006年 | 33篇 |
2005年 | 29篇 |
2004年 | 33篇 |
2003年 | 29篇 |
2002年 | 23篇 |
2001年 | 19篇 |
2000年 | 19篇 |
1999年 | 15篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 15篇 |
1995年 | 6篇 |
1994年 | 13篇 |
1993年 | 6篇 |
1992年 | 10篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有849条查询结果,搜索用时 15 毫秒
141.
针对加肋拱顶稳定性十分复杂的问题,基于ANSYS建立了加肋拱顶油罐的三维有限元模型,对加肋拱顶的结构稳定性进行了数值模拟。对加肋拱顶在外压作用下的线性与非线性临界屈曲载荷进行了对比分析,利用弧长法获得了拱顶在加肋情况下径向、环向、轴向的载荷-位移曲线。结果表明:数值模拟的加肋拱顶屈曲方向和屈曲区域与实际失稳结果相一致,可以为加肋拱顶设计和稳定性分析提供一定参考。 相似文献
142.
精、气、神文化是营区规划设计的核心.自然仿生设计为营区精、气、神文化的表达提供了独特而有效的方式.通过对营区精、气、神文化的解读,发掘出自然仿生的3个层面,即“形”之仿生,“意”之仿生和“结构”之仿生.在营区规划设计中,当自然仿生的这3个层面得到有效表达,实现有机统一,营区就会产生独特的文化气质与魅力,从而体现其精、气、神特色,展现部队的“军营魂”. 相似文献
143.
144.
边坡稳定性理论及其局限性 总被引:8,自引:1,他引:7
边坡分析理论经过近几十年的发展,基本形成了完善的体系。较为典型的有 极限平衡法,极限分析法,有限元法等。对各种分析方法做了简要的回顾与评述。基于极限 平衡原理发展的各种分析方法,大多需要做许多假设,同时对岩质边坡又不能很好地考虑其 断层节理特征。有限元强度折减法,是近年来发展起来的一种分析方法,与极限平衡法相比 不需要任何假设,可以求得任意形状边坡的临界滑移面及其对应的安全系数,同时可以反映 边坡失稳及塑性区的发展过程,为岩土体边坡分析开辟了新的途径。 相似文献
145.
二维条码技术及其在军事后勤中的应用 总被引:2,自引:0,他引:2
通过对二维条码先进技术特性的客观分析,探讨了二维条码在军事后勤中几个重要领域的应用,对在军事后勤中具体设计和应用二维条码技术进行了初步的研究. 相似文献
146.
给出了制定药物效用鉴定的序贯抽样检验方案,对未用的同类药品进行随机抽样,利用抽样结果,对剩下的N-n个样品的性能进行推断,得到判断药品是否失效的抽样方法以及有效的抽样截断方案,在减小抽样量的前提下,准确的判断药物是否有效.并对该序贯抽样性能的优劣与固定样本最优检验方法进行了比较,得到在犯同样错误的前提下,序贯抽样检验的样本量比固定样本最优检验的样本量小的多. 相似文献
147.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
148.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
149.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
150.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献